Essentially closed radical classes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Essentially Equational Theory of Horn Classes

It is well known that the model categories of universal Horn theories are locally presentable, hence essentially algebraic [2]. In the special case of quasivarieties a direct translation of the implicational syntax into the essentially equational one is known [1]. Here we present a similar translation for the general case, showing at the same time that many relationally presented Horn classes a...

متن کامل

Closed Classes

A non empty class C of connected spaces is said to be a closed class if it is closed under weak equivalences and pointed homotopy colimits. A closed class can be characterized as a non empty class of connected spaces which is closed under weak equivalences and is closed under certain simple operations: arbitrary wedges, homotopy push-outs and homotopy sequential colimits. The notion of a closed...

متن کامل

Substitution-closed pattern classes

The substitution closure of a pattern class is the class of all permutations obtained by repeated substitution. The principal pattern classes (those defined by a single restriction) whose substitution closure can be defined by a finite number of restrictions are classified by listing them as a set of explicit families.

متن کامل

Some Maximality Results for Separable, Elliptic, Essentially Pappus Classes

Let n < 0 be arbitrary. A central problem in Euclidean Lie theory is the computation of ideals. We show that ξ ≡ R(∆). Unfortunately, we cannot assume that R̂ ( 1 U , 1 2 ) = { 1 s : r̄−1 (1 ∧ |r̂|) > sin−1 ( β(O) ) sinh−1 (C′−1) } ≥ { Ȳ · 0: αα,F ( ∞−6, . . . , ξ−2 ) < 1 s(y) × log (e± δq) }

متن کامل

Square Roots of Minor Closed Graph Classes

Let G be a graph class. The square root of G contains all graphs whose square belong in G. We prove that if G is non-trivial and minor closed, then all graphs in its square root have carving-width bounded by some constant depending only on G. As a consequence, every square root of such a graph class has a linear time recognition algorithm.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics

سال: 1983

ISSN: 0263-6115

DOI: 10.1017/s1446788700024812